Certification of Confluence Proofs using CeTA
نویسندگان
چکیده
CeTA was originally developed as a tool for certifying termination proofs [5] which have to be provided as certificates in the CPF-format. Its soundness is proven within IsaFoR, the Isabelle Formalization of Rewriting. In the meantime, CeTA can also be used as a tool for certifying confluence and non-confluence proofs. In the following system description, we give a short overview on what kind of proofs are supported, and which information has to be put into the certificates. As we will see, only a small amount of information is required, so that in the future we hope that CSI [8] will not stay the only confluence tool which can produce certificates.
منابع مشابه
Certification of Complexity Proofs using CeTA
Nowadays certification is widely employed by automated termination tools for term rewriting, where certifiers support most available techniques. In complexity analysis, the situation is quite different. Although tools support certification in principle, current certifiers implement only the most basic technique, namely, suitably tamed versions of reduction orders. As a consequence, only a small...
متن کاملCertified Non-Confluence with ConCon 1.5
We present three methods to check CTRSs for non-confluence: (1) an ad hoc method for 4-CTRSs, (2) a specialized method for unconditional critical pairs, and finally, (3) a method that employs conditional narrowing to find non-confluence witnesses. We shortly describe our implementation of these methods in ConCon [8], then look into their certification with CeTA [11], and finally conclude with e...
متن کاملCertifying Confluence Proofs via Relative Termination and Rule Labeling
The rule labeling heuristic aims to establish confluence of (left-)linear term rewrite systems via decreasing diagrams. We present a formalization of a confluence criterion based on the interplay of relative termination and the rule labeling in the theorem prover Isabelle. Moreover, we report on the integration of this result into the certifier CeTA, facilitating the checking of confluence cert...
متن کاملCertification of Termination Proofs Using CeTA
There are many automatic tools to prove termination of term rewrite systems, nowadays. Most of these tools use a combination of many complex termination criteria. Hence generated proofs may be of tremendous size, which makes it very tedious (if not impossible) for humans to check those proofs for correctness. In this paper we use the theorem prover Isabelle/HOL to automatically certify terminat...
متن کاملCeTA - A Tool for Certified Termination Analysis
Since the first termination competition1 in 2004 it is of great interest, whether a proof—that has been automatically generated by a termination tool—is indeed correct. The increasing number of termination proving techniques as well as the increasing complexity of generated proofs (e.g., combinations of several techniques, exhaustive labelings, tree automata, etc.), make certifying (i.e., check...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1505.01337 شماره
صفحات -
تاریخ انتشار 2014